Blocking of dynamic multicast connections in a single link
نویسندگان
چکیده
In this paper, a method for calculating blocking experienced by dynamic multicast connections in a single link is presented. A service center at the root of a tree-type network provides a number of channels distributed to the users by multicast trees which evolve dynamically as users join and leave the channels. We reduce this problem to a generalized Engset system with nonidentical users and generally distributed holding times, and derive the call and channel blocking probabilities as well as the link occupancy distribution.
منابع مشابه
Blocking of dynamic multicast connections in a single link COST 257TD(97)46
In this paper, a method for calculating blocking experienced by dynamic multicast connections in a single link is presented. An originating o ce provides a number of channels distributed to the users by multicast subtrees which evolve dynamically as users join and leave the channels. We reduce this problem to a generalized Engset system with unidentical users and generally distributed holding t...
متن کاملA study of teletraffic problems in multicast networks
This dissertation studies teletraffic engineering of dynamic multicast connections. The traditional models in teletraffic engineering do not handle multicast connections properly, since in a dynamic multicast tree, users may join and leave the connection freely, and thus the multicast tree evolves in time. A model called multicast loss system is used to calculate blocking probabilities in a sin...
متن کاملTelecommunication Systems 0 ( 1998 ) ? ? 1 Blocking of dynamic multicast
Multicast connections have a bandwidth saving nature. This means that a multicast connection in taking the form of a tree with streams merging at the nodes requires much less capacity from the network links than a bunch of separate point-to-point connections providing the same connectivity. In this paper, we consider dynamic multicast connections that can be used to model, for example, TV or ra...
متن کاملAn Exact Algorithm for Calculating Blocking Probabilities in Multicast Networks
The paper deals with tree-structured point-to-multipoint networks, where users from infinite user populations at the leaf nodes subscribe to a variety of channels, offered by one source. The users joining the network form dynamic multicast connections that share the network resources. An exact algorithm for calculating end-to-end call blocking probabilities for dynamic connections is devised fo...
متن کاملProtecting Multicast Session in Survivable WDM Mesh Networks
Protecting light-tree based multicast connections are more demanding than unicast connections in wavelength division multiplexing (WDM) based mesh networks. In this work, we proposed two mathematical models and a heuristic based approach to protect multicast connections in WDM mesh networks. The mathematical models presented in this paper are based on multiple unicast connections. Link-protecti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998